The early promises of DNA computing to deliver a massively parallelarchitecture well-suited to computationally hard problems have so far beenlargely unkept. Indeed, it is probably fair to say that only toy problems havebeen addressed experimentally. Recent experimental development on algorithmicself-assembly using DNA tiles seem to offer the most promising path toward apotentially useful application of the DNA computing concept. In this paper, weexplore new geometries for algorithmic self-assembly, departing from thosepreviously described in the literature. This enables us to carry outmathematical operations like binary multiplication or cyclic convolutionproduct. We then show how to use the latter operation to implement an attackagainst the well-known public-key crypto system NTRU.
展开▼
